By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 24, Issue 3, pp. 411-671

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs

Wen Lian Hsu

pp. 411-439

BibTeX  Abstract Full Text:  PDF

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Ajit Agrawal, Philip Klein, and R. Ravi

pp. 440-456

BibTeX  Abstract Full Text:  PDF

Rectilinear Path Problems among Rectilinear Obstacles Revisited

Chung-Do Yang, D. T. Lee, and C. K. Wong

pp. 457-472

BibTeX  Abstract Full Text:  PDF

Evaluation of Polynomials Using the Structure of the Coefficients

Jürg Ganz

pp. 473-483

BibTeX  Abstract Full Text:  PDF

When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?

Alan Frieze, Richard M. Karp, and Bruce Reed

pp. 484-493

BibTeX  Abstract Full Text:  PDF

Scaling Algorithms for the Shortest Paths Problem

Andrew V. Goldberg

pp. 494-504

BibTeX  Abstract Full Text:  PDF

Counterexamples for Directed and Node Capacitated Cut-Trees

András A. Benczúr

pp. 505-510

BibTeX  Abstract Full Text:  PDF

Tree Reconstruction from Partial Orders

Sampath K. Kannan and Tandy J. Warnow

pp. 511-519

BibTeX  Abstract Full Text:  PDF

A Generalization of the Suffix Tree to Square Matrices, with Applications

Raffaele Giancarlo

pp. 520-562

BibTeX  Abstract Full Text:  PDF

Efficient Algorithms for the Hitchcock Transportation Problem

Takeshi Tokuyama and Jun Nakano

pp. 563-578

BibTeX  Abstract Full Text:  PDF

Approximate Max-Flow on Small Depth Networks

Edith Cohen

pp. 579-597

BibTeX  Abstract Full Text:  PDF

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

Richard A. Duke, Hanno Lefmann, and Vojtech Rödl

pp. 598-620

BibTeX  Abstract Full Text:  PDF

A Variational Method for Analysing Unit Clause Search

Henri-M. Méjean, Henri Morel, and Gérard Reynaud

pp. 621-649

BibTeX  Abstract Full Text:  PDF

A General Approach to Removing Degeneracies

Ioannis Z. Emiris and John F. Canny

pp. 650-664

BibTeX  Abstract Full Text:  PDF

A Priori Bounds on the Euclidean Traveling Salesman

Timothy Law Snyder and J. Michael Steele

pp. 665-671

BibTeX  Abstract Full Text:  PDF